LeetCode Solutions

Appearance

392. 判断子序列 ​

为保证权益，题目请参考 392. 判断子序列(From LeetCode).

解决方案1 ​

CPP ​

C++
//
// Created by lenovo on 2020-07-27.
//
#include <iostream>
#include <string>

using namespace std;

class Solution {
public:
    bool isSubsequence(string s, string t) {

    }
};

int main() {
    return 0;
}